The Emergence of Trust in Multi-Agent Bidding: A Computational Approach

نویسندگان

  • D. J. Wu
  • Yanjun Sun
چکیده

We experiment conditions for the emergence of trust in a multi-agent bidding setting using a computational approach. This is a follow up of our study on multi-agent bidding and contracting for non-storable goods. In this framework, there is a long-term contract market as well as a back-stop spot market. Seller agents bid into an electronic bulletin board their contract offers in terms of price and capacity, while Buyer agents decide how much to contract with the Sellers and how much to shop from the spot market. The goal is the following: First, to investigate if agents using reinforcement learning (nonmyopic bidding) can discover good and effective bidding, auction and contracting strategies when playing repeated non-linear games where there does not exist any equilibrium; Second, to explore the emergence of trust in the sense of what kind of mechanisms induce cooperation in the above repeated non-linear game.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A multi Agent System Based on Modified Shifting Bottleneck and Search Techniques for Job Shop Scheduling Problems

This paper presents a multi agent system for the job shop scheduling problems. The proposed system consists of initial scheduling agent, search agents, and schedule management agent. In initial scheduling agent, a modified Shifting Bottleneck is proposed. That is, an effective heuristic approach and can generate a good solution in a low computational effort. In search agents, a hybrid search ap...

متن کامل

Evaluation of Price-Sensitive Loads\' Impacts on LMP and Market Power using LMP Decomposition

This paper presents a novel approach for evaluating impacts of price-sensitive loads on electricity price and market power. To accomplish this aim an analytical method along with agent-based computational economics are used. At first, Nash equilibrium is achieved by computational approach of Q-learning then based on the optimal bidding strategies of GenCos, which are figured out by Q-learning, ...

متن کامل

Dynamic configuration and collaborative scheduling in supply chains based on scalable multi-agent architecture

Due to diversified and frequently changing demands from customers, technological advances and global competition, manufacturers rely on collaboration with their business partners to share costs, risks and expertise. How to take advantage of advancement of technologies to effectively support operations and create competitive advantage is critical for manufacturers to survive. To respond to these...

متن کامل

Stability Assessment Metamorphic Approach (SAMA) for Effective Scheduling based on Fault Tolerance in Computational Grid

Grid Computing allows coordinated and controlled resource sharing and problem solving in multi-institutional, dynamic virtual organizations. Moreover, fault tolerance and task scheduling is an important issue for large scale computational grid because of its unreliable nature of grid resources. Commonly exploited techniques to realize fault tolerance is periodic Checkpointing that periodically ...

متن کامل

Intelligent multi-agent modeling of the interbank network and evaluation of the impact of regulatory policies

agent-based modeling is an emerging computational technique that makes it possible to simulate complex economic systems, including the banking network, with a bottom-up approach. In this paper, the country's banking network is simulated with an intelligent multi-agent modeling model and indicates that these agents behave based on the adaptive learning. This modeling has been done with the aim o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001